A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap
نویسندگان
چکیده
In a graph , a set is said to be total dominating if every is adjacent to some member of . When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Selfstabilization, introduced by Dijkstra [1, 2], is the most inclusive approach to fault tolerance in distributed systems [3, 4]. We propose a new self-stabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph. We also show how the basic ideas behind the proposed protocol can be generalized to solve other related problems.
منابع مشابه
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.
متن کاملSelf-Stabilizing Algorithms for {k}-Domination
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a nite amount of time the system converges to a global state, satisfying some desired property. A function f : V (G) ! f0; 1; 2; : : : ; kg is a fkgdominating function if j2N[i]f(j) k for all i 2 V (G). In this paper we present self-stabilizing algorithms for nding a mini...
متن کاملDistributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. The algorithm utilizes an interesting result of [MP88]. We show the correctness o...
متن کاملComputer Science Technical Report A Self-Stabilizing Distributed Algorithm to Construct An Arbitrary Spanning Tree of a Connected Graph
We propose a simple self-stabilizing distributed algorithm that maintains an arbitrary spanning tree in a connected graph. In proving the correctness of the algorithm we develop a new technique without using a bounded function (which is customary for proving correctness of self-stabilizing algorithms); the new approach is simple and can be potentially applied to proving correctness of other sel...
متن کاملA Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems
The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distance-versions of the concept of minimal dominating sets are more applicable to modeling real-world problems, such as pl...
متن کامل